An offset algorithm for polyline curves
نویسندگان
چکیده
Polyline curves which are composed of line segments and arcs are widely used in engineering applications. In this paper, a novel offset algorithm for polyline curves is proposed. The offset algorithm comprises three steps. Firstly, the offsets of all the segments of polyline curves are calculated. Then all the offsets are trimmed or joined to build polyline curves that are called untrimmed offset curves. Finally, a clipping algorithm is applied to the untrimmed offset curves to yield the final results. The offset algorithm can deal with polyline curves that are self-intersection, overlapping or containing small arcs. The new algorithm has been implemented in a commercial system TiOpenCAD 8.0 and its reliability is verified by a great number of examples. # 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Fast, precise flattening of cubic Bézier path and offset curves
We present two related algorithms for flattening (generating polyline approximations for) curves associated with planar cubic Bézier segments. One flattens the path curve, and the other flattens the left and right offset curves. The algorithm for flattening path curves yields an average of 67% of the vertices generated by recursive subdivision, while maintaining flatness to within 4% of the spe...
متن کاملEfficiently computing geodesic offsets on triangle meshes by the extended Xin-Wang algorithm
Geodesic offset curves are important for many industrial applications, such as solid modeling, robot-path planning, the generation of tool paths for NC machining, etc. Although the offset problem is well studied in classical differential geometry and computer-aided design, where the underlying surface is sufficiently smooth, very few algorithms are available for computing geodesic offsets on di...
متن کاملDeforming Curves in the Plane for Tethered-robot Motion Planning
(Extended Abstract) Susan Herty Vladimir Lumelskyz Abstract We present an algorithm that deforms a given set of polygonal lines (polylines) de ned on a set of 2n vertices into the new set of polylines that results from one of the vertices moving along a straight line to a new point in the plane, creating bends in the polylines intersected by the line of motion. The algorithm has applications in...
متن کاملAlgorithm for orthogonal projection of parametric curves onto B-spline surfaces
This paper proposes an algorithm for calculating the orthogonal projection of parametric curves onto B-spline surfaces. It consists of a second order tracing method with which we construct a polyline to approximate the pre-image curve of the orthogonal projection curve in the parametric domain of the base surface. The final 3D approximate curve is obtained by mapping the approximate polyline on...
متن کاملDiscrete Curvature and Torsion-based Parameterization Scheme for Data Points
Parameterization for data points is a fundamental problem in the field of Computer Aided Geometric Design. Recently, an improved centripetal parameterization technique is proposed by Fang et al and its superiority to other common methods, such as uniform method, chord length method, centripetal method, Foley method and universal method, etc., is validated by a lot of numerical examples. In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers in Industry
دوره 58 شماره
صفحات -
تاریخ انتشار 2007